Simplicial Decomposition with Disaggregated Representation for the Traffic Assignment Problem
نویسندگان
چکیده
منابع مشابه
Simplicial Decomposition with Disaggregated Representation for the Traffic Assignment Problem
The class of simplicial decomposition (SD) schemes have shown to provide efficient tools for nonlinear network flows. When applied to the traffic assignment problem, shortest route subproblems are solved in order to generate extreme points of the polyhedron of feasible flows, and, alternately, master problems are solved over the convex hull of the generated extreme points. We review the develop...
متن کاملSimplicial Decomposition with Disaggregated Representation for the Traac Assignment Problem
The class of simplicial decomposition (SD) schemes have shown to provide e cient tools for nonlinear network ows. When applied to the tra c assignment problem, shortest route subproblems are solved in order to generate extreme points of the polyhedron of feasible ows, and, alternately, master problems are solved over the convex hull of the generated extreme points. We review the development of ...
متن کاملUsing ACCPM in a simplicial decomposition algorithm for the traffic assignment problem
The purpose of the traffic assignment problem is to obtain a traffic flow pattern given a set of origindestination travel demands and flow dependent link performance functions of a road network. In the general case, the traffic assignment problem can be formulated as a variational inequality, and several algorithms have been devised for its efficient solution. In this work we propose a new appr...
متن کاملA Computational Comparison of two Simplicial Decomposition Approaches for the Separable Traffic Assignment Problem: RSDTA and RSDVI
The class of simplicial decomposition methods has shown to constitute efficient tools for the solution of the variational inequality formulation of the general traffic assignment problem. The paper presents a particular implementation of such an algorithm, called RSDVI, and a restricted simplicial decomposition algorithm, developed adhoc for diagonal, separable, problems named RSDTA. Both compu...
متن کاملthe algorithm for solving the inverse numerical range problem
برد عددی ماتریس مربعی a را با w(a) نشان داده و به این صورت تعریف می کنیم w(a)={x8ax:x ?s1} ، که در آن s1 گوی واحد است. در سال 2009، راسل کاردن مساله برد عددی معکوس را به این صورت مطرح کرده است : برای نقطه z?w(a)، بردار x?s1 را به گونه ای می یابیم که z=x*ax، در این پایان نامه ، الگوریتمی برای حل مساله برد عددی معکوس ارانه می دهیم.
15 صفحه اولذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Transportation Science
سال: 1992
ISSN: 0041-1655,1526-5447
DOI: 10.1287/trsc.26.1.4